2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)最新文献_第7页

Performance analysis of IEEE 802.15.4 MAC layer: Prospect for multi-hop networks IEEE 802.15.4 MAC层性能分析:多跳网络的展望

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947794

M. S. Kiran, Raja Vara Prasad Yerra, V. Subrahmanyam, P. Rajalakshmi

引用次数: 2

Leveraging decoupling in enabling energy aware D2D communications 利用解耦来实现能量感知的D2D通信

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947821

Mukesh Kumar Giluka, M. S. A. Khan, V. Sathya, A. Franklin

引用次数: 5

A comparison of network bandwidth efficiencies among various multi-layer network architectures 各种多层网络架构的网络带宽效率比较

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947847

A. Gopalan, O. Turkcu, Biao Lu, Snigdho Bardalai, P. Kandappan

引用次数: 0

An advanced Diffie-Hellman approach to image steganography 一种先进的迪菲-赫尔曼图像隐写方法

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947849

Shreyank N. Gowda

{"title":"An advanced Diffie-Hellman approach to image steganography","authors":"Shreyank N. Gowda","doi":"10.1109/ANTS.2016.7947849","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947849","url":null,"abstract":"Diffie-Hellman key exchange is one of the most popular key exchange algorithms used in cryptography. Steganography is the approach of hiding information in a medium. When that medium is an image it is called as image steganography. The most popular image steganography algorithm in use presently is the Least Significant bit Algorithm (LSB). However this algorithm has proved to be easy to crack and hence rather insecure. The proposed algorithm uses a variation of the Diffie-Hellman algorithm to determine the pixel positions of the image to embed the information in. Both the sender and receiver maintain private keys. Along with this a public key is shared between them. The sender sends a public key to the receiver and vice versa. This public key is nothing but the product of the private key with the public key. The shared secret key is then the public key received multiplied with the private key of each. Now this value obtained is considered to be the pixel to embed data in. So all pixels with multiples of this value are embedded first using LSB. If still some data persists, then the shared key is substracted by 1 and all multiples of this new value are then filled. The process is repeated till the entire information is hidden.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114127826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Defragmentation of flexible dense wavelength division multiplexing (FDWDM) networks using wavelength tunability criterion 基于波长可调谐准则的柔性密集波分复用(FDWDM)网络碎片整理

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947856

B. KrishnaKumarNaik, R. Dutta, G. Shashidhara, R. Gowrishankar, Siva Sankara Sai Sanagapati, B. S. Kishore, P. Behere

{"title":"Defragmentation of flexible dense wavelength division multiplexing (FDWDM) networks using wavelength tunability criterion","authors":"B. KrishnaKumarNaik, R. Dutta, G. Shashidhara, R. Gowrishankar, Siva Sankara Sai Sanagapati, B. S. Kishore, P. Behere","doi":"10.1109/ANTS.2016.7947856","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947856","url":null,"abstract":"Flexible spectrum ROADMs facilitate networks to support channels operating at heterogeneous line rates by allocating spectral resources in a dynamic and flexible manner leading to better Spectral Efficiency. In a realistic network, traffic scenario is very dynamic in nature leading to continuous tear down of existing demands and set up of new demands. This dynamic tear down and set up process leads to fragmentation of the network, in terms of spectral resources, called “Spectral fragmentation” resulting in the blocking of new demands. Therefore, an optimization mechanism handling spectrum fragmentation, called “Spectrum Defragmentation”, is of vital importance in flexgrid optical networks. Defragmentation of the spectral resources can be obtained by either changing wavelength of the demand or route of the demand or both. This paper discusses a novel defragmentation algorithm considering only the wavelength tunability criterion and performs defragmentation by moving as minimal existing traffic demands as possible in order to support the new demand.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129363536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Forming structured P2P overlays over disjoint MANET clusters 在不相交的MANET集群上形成结构化的P2P覆盖

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947864

Anurag Sewak, M. Pandey, M. M. Gore

{"title":"Forming structured P2P overlays over disjoint MANET clusters","authors":"Anurag Sewak, M. Pandey, M. M. Gore","doi":"10.1109/ANTS.2016.7947864","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947864","url":null,"abstract":"Generally, WiFi is used to provide connectivity to mobile device users at public places like airports, railway stations, etc. Mobile devices can utilize WiFi as underlying substrate to run structured Peer-to-Peer (P2P) overlay applications for content sharing. The density of mobile users at these places is unpredictable, and often many users may not get WiFi facility. This is due to the fact that at any instance, WiFi access points can provide services to a limited number of users. Another alternative is to form a Mobile Ad hoc Network (MANET) of these mobile devices for running structured P2P overlay applications. However, due to non-uniform distribution of users different disjoint clusters of MANET may be formed. This results in formation of different disjoint Distributed Hash Tables (DHTs) at the application level, leading to inefficient lookup performance. In this paper, we suggest two possible approaches for connecting these disjoint DHTs. In the first approach, existing WiFi infrastructure can be utilized to act as a bridge between the disjoint partitions; whereas in the second approach, strategically deployed fixed relay nodes can be used for merging the partitions. The first approach is more challenging, as it requires dynamic switching between the two modes (infrastructure/ad hoc) of wireless network interface cards of mobile devices. The second approach is naive, but may act as good proof of concept to justify connecting disjoint DHTs.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130903267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

OPPRES: Opportunistic Routing algorithm for routing messages in emergency situations using vehicular delay tolerant network OPPRES:利用车辆容忍延迟网络在紧急情况下路由消息的机会路由算法

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947851

M. Penurkar, U. Deshpande

{"title":"OPPRES: Opportunistic Routing algorithm for routing messages in emergency situations using vehicular delay tolerant network","authors":"M. Penurkar, U. Deshpande","doi":"10.1109/ANTS.2016.7947851","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947851","url":null,"abstract":"A vehicular delay tolerant network (VDTN) is a special type of delay tolerant network (DTN), in which vehicles act as mobile nodes that are carriers of the message. It is characterized by the absence of an end-to-end connectivity between the nodes residing at the extreme ends. The routing in VDTN is critical as nodes are not connected permanently and the goal is to complete the message delivery successfully. We propose an opportunistic Routing algorithm for Emerging Situations (OPPRES) using VDTN to route messages in the real world. OPPRES is based on a utility mechanism for routing messages in VDTN. The algorithm takes into account node's contact history recorded as a utility for forwarding the messages. This history comprises the past encounters of a node with the destination nodes or the relay nodes. The algorithm can be used to route the messages in emergency situations. Simulations show that, our algorithm OPPRES beat some existing DTN routing approaches like PRoPHET and Spray-and-Wait in terms of increased message delivery ratio and less average delivery latency at the cost of the large overhead ratio.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134555651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Synchronization of TDMA bursts with short preamble for satellite receiver 卫星接收机短前导时分多址突发同步

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947840

B. Purushothaman, A. Veeresh, S. Prasad, S. Prasad, G. Pradeep

引用次数: 5

The smart bus for a smart city — A real-time implementation 面向智慧城市的智能公交——实时实现

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947850

Sharad, Bagavathi Sivakumar, Anantha Narayanan

引用次数: 20

Optimal power allocation for cognitive radio multicast networks under primary users' outage loss constraint 主用户中断损失约束下认知无线电组播网络的最优功率分配

2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) Pub Date : 2016-11-01 DOI: 10.1109/ANTS.2016.7947801

S. Bhattacharjee, T. Acharya, U. Bhattacharya

{"title":"Optimal power allocation for cognitive radio multicast networks under primary users' outage loss constraint","authors":"S. Bhattacharjee, T. Acharya, U. Bhattacharya","doi":"10.1109/ANTS.2016.7947801","DOIUrl":"https://doi.org/10.1109/ANTS.2016.7947801","url":null,"abstract":"In this paper, we consider an underlay cognitive radio (CR) multicast network where secondary users (SUs) coexist with primary users (PUs). The cognitive radio network (CRN) consists of a cognitive base station (CBS) and multiple multicast groups. Each multicast group comprises of a number of SUs and is served by the CBS using a common PU channel. Our objective is to minimize the aggregate group outage probability for the CR multicast network. To protect Pus' transmission, a probabilistic model of interference is considered unlike the traditional interference temperature constraint. In addition, an average transmit power constraint is imposed on CBS's transmission. The problem is formulated using constrained optimization framework and an optimal transmit power control policy is proposed. The power adaptation strategy clearly illustrates the dependence of CBS's transmission power on various system parameters including Pus' channel conditions and target rates, link interferences as well as multicast group target rates and SUs' channel conditions. Simulation results are presented to validate the proposed power allocation scheme.","PeriodicalId":248902,"journal":{"name":"2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130437898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4