Liu Yingji, Shu-ju Wang, Chenglong Ding, Yao Yu, Xiao Hongwen, Jie Xia
{"title":"A PCGL-based data loading algorithm for electrical vehicle time-triggered CAN","authors":"Liu Yingji, Shu-ju Wang, Chenglong Ding, Yao Yu, Xiao Hongwen, Jie Xia","doi":"10.1504/IJMNDI.2018.10011188","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10011188","url":null,"abstract":"In this paper, a period correlative group loading (PCGL)-based algorithm is proposed specifically for the real-time communication of random messages in electrical vehicle TTCAN networks. By compressing the bandwidth radio of the synchronous phase, the real-time response of event-triggered messages is accelerated. The PCGL-based scheduling approach will be detailed and described. The proposed method is tested on the scheduling for SAE electrical vehicle message standard and the results show that, on the premise of guaranteeing the real-time efficiency of time-triggered messages, the real-time efficiency of event-triggered messages is significantly improved.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"63 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2018-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74495580","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}
{"title":"An efficient artificial bee colony algorithm for optimising the design of rectangular microstrip patch antenna","authors":"R. Anita, M. Chaitanyakumar","doi":"10.1504/IJMNDI.2018.10011189","DOIUrl":"https://doi.org/10.1504/IJMNDI.2018.10011189","url":null,"abstract":"Antenna is a very important component of communication systems. An antenna is a device used to transform an RF signal, travelling on conductor, into an electromagnetic wave in free space. The transmitter signal is sent into space by a transmitting antenna; the RF signal is picked up from space by a receiving antenna. Microstrip antenna is also referred as a patch antenna. In designing rectangular microstrip patch antennas, a number of substrate can be used. Rectangular microstrip patch antennas are attractive due to their light weight, conformability and low cost. These antennas can be integrated with printed strip-line feed networks and active devices. The design is determined by optimal selection of dimensions, which represent the length and width, of the antenna structure. To optimise the dimensions, ABC-PSO algorithm is proposed in our work. The experimental results demonstrated that the designed antenna gives ideal radiation characteristics over the operating bands. Subsequently, the performance is compared in detail with the existing designs. The cheering outcomes achieved have unequivocally ratified effectiveness of our proposed technique and is able to improve the design parameter.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"30 1","pages":"7"},"PeriodicalIF":0.0,"publicationDate":"2018-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89586836","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}
{"title":"All-IP WSN backbone formation based on location information","authors":"Qi Sun, Xiaonan Wang, D. Wang","doi":"10.1504/IJMNDI.2017.10006584","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006584","url":null,"abstract":"This paper proposes an all-IP WSN formation scheme based on location information. In the scheme, the all-IP WSN architecture based on location information is proposed and it can use a small number of backbone nodes to cover the entire WSN area, so the network formation cost and delay are reduced. Based on the architecture, the backbone node election algorithm and the backbone tree formation algorithm are proposed. Through a backbone tree, the routing can be achieved without either route discovery or routing information storage. Based on the architecture, the backbone tree maintenance algorithm is also proposed to maintain the backbone tree topology so that the routing correctness can be ensured. The performance parameters of this proposal are evaluated and compared, and the data results show that this proposal effectively reduces the network formation delay and cost.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"5 1","pages":"78"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80541307","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}
{"title":"Energy and mobility aware route optimisation technique based on genetic algorithm in MANETs","authors":"G. Mathiyalagan, A. Wahi","doi":"10.1504/IJMNDI.2017.10006583","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006583","url":null,"abstract":"Due to the fact that in mobile ad hoc networks (MANETs), nodes being highly mobile and operate on battery capacity, battery consumption and mobility of the nodes pose as major issues. To resolve this issue, the energy consumed by each node should be distributed equally thereby minimising the overall transmission power. In order to achieve this, an energy and mobility aware route optimisation technique based on genetic algorithm has been proposed in this paper. In this approach, the network estimates the estimated geometrical distance (EGD) metric. Here, the weak links are excluded from the network. Then, an estimation of min-max battery capacity and node connectivity index is done. Genetic algorithm is applied for selecting the routes with a best fitness function based on these metrics. Based on the simulation results, we gather that the proposed technique reduces delay and overhead along with the increased packet delivery ratio and residual energy.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"11 1","pages":"69"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73012921","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}
{"title":"Cluster-based routing using fuzzy and bee colony optimisation in mobile wireless sensor networks","authors":"M. Sudha, J. Sundararajan","doi":"10.1504/IJMNDI.2017.10006587","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006587","url":null,"abstract":"In mobile wireless sensor networks, the existing routing technique results in increased energy consumption, time consumption, delay, increased mobility, and so on. Hence, in this paper, we propose a cluster-based routing using fuzzy and bee colony optimisation in mobile wireless sensor networks. In this technique, cluster heads are elected using artificial bee colony (ABC) algorithm based on the mobility factor. Then, timeslots are assigned to each cluster member using TDMA schedule. Moreover, an inter cluster routing scheme is developed for the cluster members to route the collected messages using fuzzy logic based on the number of hops, battery level, and mobility factor.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"571 1","pages":"109"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85735581","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}
{"title":"Game-theory-based load balancing technique for vertical handoff in next generation networks","authors":"V. Kaushik, J. S. Sodhi, R. Tyagi","doi":"10.1504/IJMNDI.2017.10006586","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006586","url":null,"abstract":"In the next generation networks, during vertical handoff, it is good practice to balance the network load to increase the efficiency and reduce the overhead. In this paper, we propose to model a game theory-based load balancing technique for vertical handoff in next generation networks. Initially the network load is defined based on the QoS service classes that includes UGS, rtPS, ertPS, nrtPS, and BE and performance parameters that includes throughput for uplink and downlink, delay, battery power and signal strength. This helps in deciding the suitable mobile stations for transferring from overloaded base station to lightly loaded base stations. Further for balancing the load, a game theory model is applied. In this approach, the total load of the overloaded users and battery capacity are checked in order to determine the number of satisfied users which corresponds to the utility function. By simulation results, we show that the proposed approach increases the efficiency, decreases the load and overhead.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"1 1","pages":"101"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76197886","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}
{"title":"Dynamic mobility management scheme for inter handoff in hybrid wireless mesh networks","authors":"Dr Narayana Rao Appini, C. Rao","doi":"10.1504/IJMNDI.2017.10006588","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006588","url":null,"abstract":"Our work focuses to determine the more reliable routing path to increase the quality of service with fast route recovery process and also to find the most effective path for transmitting the same data towards multiple destination nodes. Thus in this paper we have proposed to design a dynamic mobility management scheme for inter handoff in WMN. For mobility, the inter-domain mobility management scheme is applied. To reduce the overall network traffic incurred by this mobility management, the dynamic pointer forwarding scheme for internet traffic is used. Simulation results show that the proposed mobility management scheme provides reduced packet drop and delay when compared with the existing scheme.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"33 1","pages":"118"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86719744","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}
{"title":"Performance analysis of on-demand routing protocol for MANET using EA3ACK algorithm","authors":"K. Thamizhmaran, M. Anitha, A. Nachiappan","doi":"10.1504/IJMNDI.2017.10006585","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10006585","url":null,"abstract":"Mobile ad-hoc networks (MANETs) do not have a fixed infrastructure. Every single node in the MANET works as both receiver and transmitter. Each node directly communicates with the other when they are both within their communication range. All nodes work as routers and take path in discovery and maintenance of routes to other nodes in the network. In this paper, a new intrusion detection system, enhanced adaptive 3 acknowledgement (EA3ACK), using EAACK with hybrid cryptography is (MARS4) specially designed for MANET. In the hybrid cryptography a two key method namely MARS4 which is a combination of RSA and MAJE4 is employed to reduce the routing overhead. Network simulator (NS2) is used to implement and test the proposed system. The proposed hybrid cryptography provides secured transmission, further it reduces routing overhead, improves packet delivery ratio and throughput.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"10 1","pages":"88"},"PeriodicalIF":0.0,"publicationDate":"2017-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81856077","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}
{"title":"From multilevel security to multiple independent levels of security/safety: the evolution illustrated through a novel cross-domain architecture","authors":"Angelo Liguori","doi":"10.1504/IJMNDI.2017.10003739","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.10003739","url":null,"abstract":"Since years organisations classify information according to security schemes and various criteria. The requirement to protect information characterised by a hierarchy of sensitivity levels led to the definition of multilevel security. Multilevel security represents one of the toughest problems that security engineers are still facing, due to the fact that it is difficult to manage securely information at different classification levels on the same electronic device or network. It concerns wired and wireless communications, from personal area and wireless sensor networks to wide area and satellite networks. The problem becomes even more critical when users with various clearances, privileges, and roles need to operate simultaneously on these security-motley data. Recently, a new approach gathered the endorsement of industry and academia, the so-called multiple independent levels of security/safety. In this article, we show the evolution that drove the multilevel security into this new paradigm, highlighting the benefits and the drawbacks of the former together with the improvement of the latter and its open issues. A novel cross-domain solution is presented as the thread in-between the two approaches.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"11 1","pages":"22"},"PeriodicalIF":0.0,"publicationDate":"2017-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82912379","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}
Sarah Edenhofer, Sven Tomforde, D. Fischer, J. Hähner, F. Menzel, S. Mammen
{"title":"Decentralised trust-management inspired by ant pheromones","authors":"Sarah Edenhofer, Sven Tomforde, D. Fischer, J. Hähner, F. Menzel, S. Mammen","doi":"10.1504/IJMNDI.2017.082804","DOIUrl":"https://doi.org/10.1504/IJMNDI.2017.082804","url":null,"abstract":"Computational trust is increasingly utilised to select interaction partners in open technical systems consisting of heterogeneous, autonomous agents. Current approaches rely on centralised elements for managing trust ratings (i.e. control and provide access to aggregated ratings). Consider a grid computing application as illustrating example: agents share their computing resources and cooperate in terms of processing computing jobs. These agents are free to join and leave, and they decide on their own with whom to interact. The impact of malicious or uncooperative agents can be countered by only cooperating with agents that have shown to be benevolent: trust relationships are established. Typically, this requires a centralised data-base storing information about past interactions and their outcome. In this article, we propose a novel, decentralised trust mechanism inspired by the nestmate recognition system in ants. More precisely, the concept of recognition pheromones, which stick to the agents and cannot be removed or counterfeit, is turned into algorithmic logic and interaction protocols. We demonstrate the potential benefit by using simulations of the grid scenario.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"70 1","pages":"46-55"},"PeriodicalIF":0.0,"publicationDate":"2017-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74720157","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}