Current Issue : July - September Volume : 2015 Issue Number : 3 Articles : 5 Articles
Gossiping of a single source withmultiplemessages (by splitting information into pieces) has been treated only for complete graphs,\nshown to considerably reduce the completion time, that is, the first time at which all network nodes are informed, compared\nwith single-message gossiping. In this paper, gossiping of a single source with multiple messages is treated, for networks modeled\nas certain structured graphs, wherein upper bounds of the high-probability completion time are established through a novel\nââ?¬Å?dependency graphââ?¬Â technique.The results shed useful insights into the behavior of multiple-message gossiping and can be useful\nfor data dissemination in sensor networks, multihopping content distribution, and file downloading in peer-to-peer networks...
We present a novel framework formultiple pedestrian tracking using overlapping cameras inwhich the problems of object detection\nand data association are solved alternately. In each round of our algorithm, the people are detected by inference on a factor\ngraph model at each time slice. The outputs of the inference, namely, the probabilistic occupancy maps, are used to define a cost\nnetwork model. Data association is achieved by solving a min-cost flow problem on the resulting network model. The outputs\nof the data association, namely, the ground occupancy maps, are used to control the size of factors in graph model in the next\nround. By alternating between object detection and data association, a desirable compromise between complexity and accuracy is\nobtained. Experiments results on public datasets demonstrate the competitiveness of our method compared with other state-ofthe-\nart approaches....
RFID is one of the most protuberant systems in the field of ubiquitous computing. Since RFID tags have limited computation\ncapabilities, numerous ultralightweight authentication protocols have been proposed to provide privacy and security. However all\nthe previously proposed ultralightweight mutual authentication protocols have some security apprehensions and are vulnerable\nto various desynchronization and full disclosure attacks. This paper proposes a new ultralightweight mutual authentication\nprotocol to provide robust confidentiality, integrity, and authentication (RCIA) in a cost effective manner. RCIA introduces\na new ultralightweight primitive recursive hash, which efficiently detects the message tempering and also avoids all possible\ndesynchronization attacks. RCIAinvolves only bitwise operations such asXOR,AND, left rotation, and recursive hash. Performance\nevaluation illustrates that RCIA requires less resources on tag in terms of on-chipmemory, communication cost, and computational\noperations....
With the pervasiveness of mobile communications, MSNs have become a promising networking paradigm for users to share\ncontents with others through mobile devices. This convenience comes at the cost of some serious security and privacy issues. In this\nwork, we propose a novel privacy-preserving scheme for MSNs, which can efficiently solve some of the most serious security and\nprivacy issues such as data confidentiality, fine-grained access control, and flexible revocation. In particular,we leverage the attribute\nbased encryption technique to realize fine-grained access control over encrypted data. Moreover, we enhance this technique and\ndesign a flexible and fine-grained revocation mechanism which enables not only efficient user revocation but also efficient attribute\nrevocation. As we show, our system can achieve both forward secrecy and backward secrecy using such mechanism.We compare\nour scheme with other related works and show that not only most of the previous works suffer from larger size of encrypted data\nbut also their decryption time grows linearly with the complexity of access policies. In comparison, our scheme achieves higher\nefficiency and smaller computation time while consuming lesser storage space. We provide extensive analysis and performance\nevaluation to demonstrate the security, scalability, and efficiency of our proposed framework....
Wireless sensor network (WSN) is considered as the enabling technology to bridge the gap between the physical and digital world.\nSome of the applications environments ofWSNrequire a mobile sink to operate in the sensor fieldwhere delayed and/or partial data\ndelivery might lead to inappropriate conclusions and thus require high quality of service in terms of latency and packets delivery\nratio. Majority of existing mobile sink based data dissemination schemes aim to prolong network lifetime whereas few schemes\nimprove the data delivery performance by employing multiple mobile sinks which add to the hardware and operating cost. In this\npaper we propose a virtual grid based data dissemination (VGDD) scheme that aims to optimize the tradeoff between network\nlifetime and data delivery performance while adhering to the low cost theme of WSN. Using the virtual structure, the proposed\nVGDDscheme follows a set of rules to disseminate sink�s mobility updates in an energy efficientmanner therebymaintaining nearly\noptimal routes. Furthermore, to cope with speed�s variation of mobile sink, VGDD makes use of appropriate forwarder nodes for\nguaranteed data delivery. Simulation results reveal improved data delivery performance in terms of latency and data delivery ratio\ncompared to existing work....
Loading....