A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sindhuja, J.
- Self Service Mesh Router for Wireless Mesh Network with Missed Workstation Detection
Authors
1 Department of Computer Applications, Nandha Engineering College, Perundurai, Erode, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 7, No 9 (2015), Pagination: 373-377Abstract
The term Mobile ad hoc networks (MANETs) are ultimate for a permanent framework which is busy or impracticable. Now a days, network partitioning affect MANETs. This drawback makes MANETs inappropriate for applications such as administration and combat zone connections, in which group fellows might have to toil in factions dispersed in the application territory. There will be critical intergroup communication to the team cooperation in such applications. This limitation is labeled by introducing Autonomous Mobile Mesh Network (AMMNET), a new class of ad-hoc network. The cell phone mesh nodes of an AMMNET are skilled of following the mesh patrons in the application territory, and arranging themselves into a proper network topology to make sure that mutually intra and inter faction have high-quality connectivity for interactions than usual mesh networks. A circulated client tracking key, to compact with the vibrant nature of client mobility, and current techniques for vibrant topology revision in accord with the mobility model of the clients is recommended. The outcomes of our recreation, point out that AMMNET is strong against network divisioning and talented of providing lofty relay throughput for the mobile patrons. Indicator Terms- Cell phone Mesh Networks, Vibrant Topology Consumption, and Patron Tracking.
Keywords
Autonomous Mobile Mesh Networks (AMMNET), Mobile Ad hoc Networks (MANETs), Delay Tolerant Network (DTN), Radio-Frequency Identification(RFID), Long Term Evolution (LTE).- A Lossless Approach for Data Hiding using LZW Codes
Authors
1 Department of Information Technology, Kongu Engineering College, Perundurai, 638052, IN
Source
Digital Image Processing, Vol 7, No 10 (2015), Pagination: 312-316Abstract
Hiding a message in compression codes can reduce transmission costs and simultaneously make the transmission more secure. In high-performance, data-hiding Lempel–Ziv–Welch (HPDH-LZW) scheme, which reversibly embeds data in LZW compression codes by modifying the value of the compression codes, where the value of the LZW code either remains unchanged or is changed to the original value of the LZW code plus the LZW dictionary size according to the data to be embedded. According to the embedding bits, the original value of LZW code is modified. Reversible data hiding scheme is used in compression domain where compression code is altered to hide the data. Compared to other information-hiding schemes based on LZW compression codes, the proposed scheme achieves better hiding capacity by increasing the number of symbols available to hide secrets and also achieves faster hiding and extracting speeds due to the lower computation requirements.